Maximizing privacy and security of collaborative indoor positioning using zero-knowledge proofs
نویسندگان
چکیده
The increasing popularity of wearable-based Collaborative Indoor Positioning Systems (CIPSs) has led to the development new methods for improving positioning accuracy. However, these systems often rely on protocols, such as iBeacon, that lack sufficient privacy protection. In addition, they depend centralized entities authentication and verification processes. To address limitations existing this paper presents a groundbreaking contribution field CIPSs. We propose decentralized Attribute-based Authentication (ABA) protocol offers superior levels protection, untraceability, unlinkability user actions. Unlike protocols entities, our approach leverages mechanisms verification, ensuring location data exchange. Through extensive experimentation across multiple platforms, results demonstrate practicality feasibility proposed real-world deployment. Overall, work opens up avenues secure privacy-preserving CIPSs, with potential implications rapidly growing Internet Things (IoT) applications.
منابع مشابه
Proofs of Zero Knowledge
We present a protocol for verification of “no such entry” replies from databases. We introduce a new cryptographic primitive as the underlying structure, the keyed hash tree, which is an extension of Merkle’s hash tree. We compare our scheme to Buldas et al.’s Undeniable Attesters and Micali et al.’s Zero Knowledge Sets. In the following, the term database refers to a system supplying the simpl...
متن کاملSome Zero-Knowledge Proofs
Consider a general proof system for a language in NP. That is, suppose we have a language L 2 NP and a string x 2 L. For example, let L be GRAPH-ISOMORPHISM and x = (G0; G1) a pair of isomorphic graphs. Suppose Victor is not convinced that x 2 L, so he calls his friend Peggy (who is infinitely powerful) and asks for a proof. Peggy agrees, because she’s nice that way, applies her infinite power,...
متن کاملZero-Knowledge Identity Proofs
The problem of proving identity, according to Bishop in [2], can generally be solved using some of the following things: (1) something you know (like a password), (2) something you have (like an identification badge), (3) something you are (such as a fingerprint), and (4) where you are (such as your computer’s internet address). Many identification schemes focus on the first problem, proving kn...
متن کاملZero Knowledge Proofs
Zero-knowledge proofs are cryptographic protocols that allow a prover to prove that they have some knowledge of a certain kind, without revealing any additional information about that knowledge. For example, I might want to prove that I know a secret preimage w for some hash h = hash(w), without revealing what that secret w is. Digital signatures are a bit like a zero knowledge proof: “I know a...
متن کاملZero-Knowledge Proofs of Proximity
Interactive proofs of proximity (IPPs) are interactive proofs in which the verifier runs in time sub-linear in the input length. Since the verifier cannot even read the entire input, following the property testing literature, we only require that the verifier reject inputs that are far from the language (and, as usual, accept inputs that are in the language). In this work, we initiate the study...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet of things
سال: 2023
ISSN: ['2199-1081', '2199-1073']
DOI: https://doi.org/10.1016/j.iot.2023.100801